-
1 Euler cycle
Эйлеров цикл (путь в графе, который начинается и кончается в одном и том же узле и проходит по каждому ребру точно один раз)Англо-русский словарь промышленной и научной лексики > Euler cycle
-
2 Euler path
путь Эйлера (в ориентированном графе, при котором проходятся все дуги, причём каждая из них ровно один раз); см. Euler cycleАнгло-русский словарь промышленной и научной лексики > Euler path
-
3 эйлеров цикл
эйлеров цикл
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Русско-английский словарь нормативно-технической терминологии > эйлеров цикл
-
4 эйлеров маршрут
1) Mathematics: Euler walk2) Information technology: Eulerian cycle, Eulerian path
См. также в других словарях:
Cycle (graph theory) — In graph theory, the term cycle may refer to a closed path. If repeated vertices are allowed, it is more often called a closed walk. If the path is a simple path, with no repeated vertices or edges other than the starting and ending vertices, it… … Wikipedia
Cycle Messenger World Championships — The Cycle Messenger World Championships, or CMWCs, are an annual urban cycling competition whereby cycle messengers and cycling enthusiasts showcase their skills in an array of events, many of which simulate everyday tasks for a cycle messenger.… … Wikipedia
Euler hypergeometric integral — In mathematics, the Euler hypergeometric integral is a representation of the hypergeometric function by means of an integral. It is given by:; 2F 1(a,b;c;z)=frac{Gamma(c)}{Gamma(b) Gamma(c b)}int 0^1 frac{dw} {w^{1 b} ; (1 w)^{1 c+b} ;(1 zw)^a}… … Wikipedia
List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… … Wikipedia
Graphe cycle — Ne doit pas être confondu avec Graphe des cycles ni Cycle (théorie des graphes). Graphe cycle C8 … Wikipédia en Français
Seven Bridges of Königsberg — The Seven Bridges of Königsberg is a famous historical problem in mathematics. Its 1736 negative resolution by Leonhard Euler laid the foundations of graph theory and presaged the idea of topology. Description The city of Königsberg in Prussia… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
De Bruijn digraph — The vertices of the de Bruijn digraph B(n,m) are all possible words of length m 1 chosen from an alphabet of size n.B(n,m) has n^{m} edges consisting of each possible word of length m from an alphabet of size n. The edge a 1a 2dots a n connects… … Wikipedia
Seven Bridges of Königsberg/key — Solution to the variant Königsberg = Answer Solution Reduce the city, as before, to a graph. Color each node. As in the classic problem, no Euler walk is possible; coloring does not affect this. All four nodes have an odd number of edges. The… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
